Macro-routing: a new hierarchical routing protocol - Global Telecommunications Conference, 2004. GLOBECOM '04. IEEE

نویسندگان

  • Sanda Dragos
  • Martin Collier
چکیده

In a continually evolving Internet, tools such as Quality of Service routing must be used in order to accommodate user demands. QoS routing raises scalability issues within very large networks, which can be avoided by using hierarchical routing strategies. However, such strategies can lead to inaccurate path selection due to the aggregation process. To avoid such problems we propose a hierarchical routing protocol, called Macro-routing, which can distribute the route computation more efficiently throughout the network using mobile agents. It processes more detailed information than conventional hierarchical routing protocols so is more likely to find the best path between source and destination. Also, by using mobile agents, more than one available path can be found. This provides a fast recovery mechanism, where no protocol restart is needed in a failure situation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Securing the Border Gateway Routing Protocol - Global Telecommunications Conference, 1996. GLOBECOM '96. 'Communications: The Key to Global Prosp

We analyze the security of the BGP routing protocol, and identify a number of vulnerabilities in its design and the corresponding threats. We then present a set of proposed modifications to the protocol which minimize or eliminate the most significant threats. The innovation we introduce is the protection of the second-to-last information contained in the AS-PATH attributes by digital signature...

متن کامل

On the Joint Virtual Path Assignment and Virtual Circuit Routing Problem in ATM Networks - Global Telecommunications Conference, 1994. GLOBECOM '94. 'Communications: The Global Bridge'., IE

The use of virtual paths in ATM networks reduces the call set-up delays, simplifies the hardware in the transit nodes and provides simple virtual circuit admission control. However, i t also reduces the degree of capacity sharing and, thus, increases the call blocking rate for most cases. In this paper, we consider the following problem: given a network topology, link capacity of each physical ...

متن کامل

TRANSFER: Transactions Routing for Ad-hoc Networks with eFficient EneRgy - Global Telecommunications Conference, 2003. GLOBECOM '03. IEEE

In future ad hoc networks, transactions are expected to become one of the primary types of flows. Transactions require only a very small number of packets to complete. Hence, providing optimal (or shortest path) routes to such transfers consumes more energy than the actual transfer. Conventional routing protocols are thus unsuitable for transactions. In this paper, we present a novel architectu...

متن کامل

Enhancing MPLS QoS routing algorithms by using the network protection degree paradigm - Global Telecommunications Conference, 2003. GLOBECOM '03. IEEE

* This work has been partially supported by Special Action (Spanish Ministry Science and Technology)TIC2002-10150-E. AbstractIP based networks still do not have the required degree of reliability required by new multimedia services, achieving such reliability will be crucial in the success or failure of the new Internet generation. Most of existing schemes for QoS routing do not take into consi...

متن کامل

A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks

A new global positioning system (GPS)-based routing protocol for ad hoc networks, called zone-based hierarchical link state (ZHLS) routing protocol, is proposed. In this protocol, the network is divided into nonoverlapping zones. Each node only knows the node connectivity within its zone and the zone connectivity of the whole network. The link state routing is performed on two levels: local nod...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001